Universally Constructing 12-th Degree Extension Field for Ate Pairing

نویسنده

  • Masaaki Shirase
چکیده

We need to perform arithmetic in Fp(z)12 to use Ate pairing on a Barreto-Naehrig (BN) curve, where p(z) is a prime given by p(z) = 36z + 36z + 24z + 6z+ 1 with an integer z. In many implementations of Ate pairing, Fp(z)12 has been regarded as the 6-th extension of Fp(z)2 , and it has been constructed as Fp(z)12 = Fp(z)2 [v]/(v−ξ) for an element ξ ∈ Fp(z)2 such that v − ξ is irreducible in Fp(z)2 [v]. Such ξ depends on the value of p(z), and we may use mathematic software to find ξ. This paper shows that when z ≡ 7, 11 (mod 12) we can universally construct Fp(z)2 as Fp(z)12 = Fp(z)2 [v]/(v−u−1), where Fp(z)2 = Fp(z)[u]/(u+1).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speeding Up Ate Pairing Computation in Affine Coordinates

At Pairing 2010, Lauter et al’s analysis showed that Ate pairing computation in affine coordinates may be much faster than projective coordinates at high security levels. In this paper, we further investigate techniques to speed up Ate pairing computation in affine coordinates. On the one hand, we improve Ate pairing computation over elliptic curves admitting an even twist by describing an 4-ar...

متن کامل

A study of pairing computation for curves with embedding

This paper presents the first study of pairing computation on curves with embedding degree 15. We compute the Ate and the twisted Ate pairing for a family of curves with parameter ρ 1.5 and embedding degree 15. We use a twist of degree 3 to perform most of the operations in Fp or Fp5 . Furthermore, we present a new arithmetic for extension fields of degree 5. Our computations show that these cu...

متن کامل

On Efficient Pairings on Elliptic Curves over Extension Fields

In implementation of elliptic curve cryptography, three kinds of finite fields have been widely studied, i.e. prime field, binary field and optimal extension field. In pairing-based cryptography, however, pairingfriendly curves are usually chosen among ordinary curves over prime fields and supersingular curves over extension fields with small characteristics. In this paper, we study pairings on...

متن کامل

An Improvement of Twisted Ate Pairing Using Integer Variable with Small Hamming Weight

Barreto–Naehrig (BN) curve has been introduced as a pairing-friendly elliptic curve over prime field Fp which has embedding degree 12. Characteristic and Frobenius trace are given as polynomials of integer variable χ. This paper proposes an improvement of Miller’s algorithm of twisted Ate pairing with BN curve by χ of small hamming weight. Then, in order to show the efficiency of the proposed m...

متن کامل

Constructing pairing-friendly hyperelliptic curves using Weil restriction

A pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding degree with respect to a large prime-order subgroup. In this paper we construct pairing-friendly genus 2 curves over finite fields Fq whose Jacobians are ordinary and simple, but not absolutely simple. We show that constructing such curves is equivalent to constructing elliptic curves over Fq that become ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2009  شماره 

صفحات  -

تاریخ انتشار 2009